Intra-Piconet Polling Algorithms in Bluetooth

نویسندگان

  • Jelena V. Misic
  • Vojislav B. Misic
چکیده

Bluetooth is an emerging standard for Wireless Personal Area Networks (WPANs): short range, ad hoc wireless networks [1]. Originally, Bluetooth was envisaged as a wireless cable replacement technique, which is why the basic RF range of Bluetooth devices is only about 10 meters [2]. However, the number of possible uses of Bluetooth have increased to include different networking tasks between computers and computer-controlled devices such as PDAs, mobile phones, smart peripherals, and others. However, Bluetooth networks operate in a rather different manner from other wireless networks. Furthermore, many important aspects of communication using Bluetooth networks are not defined by the current Bluetooth specification [2]. Such aspects include the manner in which the master polls its slaves, the scheduling algorithms for Bluetooth scatternets, the preferred scatternet topology (or topologies), and others. Quality of service is supported in a very limited manner, too. All of these aspects, however, play a crucial role in determining the performance of Bluetooth networks, which is ultimately one of the main criteria for their wider acceptance in the marketplace. Performance analysis of Bluetooth networks is an important research topic addressed by many researchers. Yet, because of the differences from other networks, known performance analysis results from other wireless networks cannot be directly applied in the Bluetooth environment. In this chapter, we will review and roughly classify existing algorithms for intra-piconet polling. We will also describe some of the topics that deserve future research attention.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bluetooth Time Division Duplex - Exact Analysis as a Polling System

Bluetooth enables wireless communication via ad-hoc networks. The basic network topology (piconet) is a collection of slaves controlled by a master. A scatternet is a multihop network of piconets. Efficient piconet and scatternet communication requires design of intra and inter-piconet scheduling algorithms. Thus, numerous scheduling algorithms have been recently proposed. Analytical performanc...

متن کامل

Polling and Bridge Scheduling Algorithms in Bluetooth

This report presents a brief overview and classification of intra-piconet polling schemes for Bluetooth piconets. It also presents a similar overview and classification of bridge scheduling algorithms for Bluetooth scatternets. Some additional issues, in particular the transmission of TCP/IP traffic over Bluetooth, and segmentation and reassembly policies, are discussed as well.

متن کامل

On the Exact Analysis of Scheduling Algorithms for Bluetooth Piconets and Scatternets

Bluetooth enables wireless communication via ad-hoc networks. The basic network topology (piconet) is a collection of slaves controlled by a master. A scatternet is a multihop network of piconets. Efficient piconet and scatternet communication requires design of intra and inter-piconet scheduling algorithms. Thus, numerous scheduling algorithms have been recently proposed. Analytical performanc...

متن کامل

Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets

Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, due to inherent complexities of the Bluetooth Medium Access Control (MAC), the performance of such algorithms has been analyzed mostly via simulation. We show that a piconet operated according to the limited (pure round...

متن کامل

A power-aware master and bridge scheduling scheme for bluetooth scatternets

We propose an intra-piconet and inter-piconet scheduling scheme for Bluetooth in which a master assigns priority to each slave based on its packet arrival rate, available buffer space and the number of messages stored in the master buffer for that slave. The number of times a particular slave is polled by its master in succession is dependent on the assigned priority. The slaves know the pollin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005